Design and Implementation of SKIP
نویسنده
چکیده
We present a key-distribution scheme that is particularly well suited for use in conjunction with a session-less datagram protocol such as IP or IPv6. We describe how this scheme can be used for both IP unicast and multicast applications, providing an approach for scalable multicast key distribution. We also describe an implementation of this scheme on the Solaris operating system, and present some findings on the performance of encryption at the IP layer. Note – This paper was originally presented at the INET ‘95 conference in Hawaii on June 28, 1995, under the title Simple Key Management for Internet Protocols (SKIP). It also appears in the conference proceedings under that title.
منابع مشابه
Decrease in Hardware Consumption and Quantization Noise of Digital Delta-Sigma Modulators and Implementation by VHDL
A new structure is presented for digital delta-sigma modulator (DDSM). Novel architecture decreases hardware consumption, output quantization noise and spurs in Comparison to previous architectures. In order to reduce the delay, power consumption and increase maximum working frequency, the pipelining technique and the carry skip adder are used. Simulation proposed architecture shows that the qu...
متن کاملA Service-oriented Scalable Dictionary in MPI
In this paper we present a distributed, in-memory, message passing implementation of a dynamic ordered dictionary structure. The structure is based on a distributed fine-grain implementation of a skip list that can scale across a cluster of multicore machines. We present a service-oriented approach to the design of distributed data structures in MPI where the skip list elements are active proce...
متن کاملEfficient Reversible Logic Design of BCD Subtractors
Reversible logic is emerging as a promising computing paradigm, having its applications in low-power CMOS, quantum computing, nanotechnology and optical computing. Firstly, we showed a modified design of conventional BCD subtractors and also proposed designs of carry look-ahead and carry skip BCD subtractors. The proposed designs of carry look-ahead and carry skip BCD subtractors are based on t...
متن کاملA Design of a Parallel Dictionary Using Skip Lists
We present a topdown design of a parallel PRAM dictionary using skip lists. More precisely, we give detailed algorithms to search for, insert or delete k elements in a skip list of n elements in parallel. The algorithms are iterative and easy to implement on real machines. We discuss some implementation issues and give concrete examples in C*. The algorithms run on an EREW PRAM in expected time...
متن کاملOptimal group distribution in carry-skip adders
Adders are very often in the critical path of a computer, so it is very important that their performance will not limit the cycle time of the machine. In VLSI applications, area and power are also important factors which must be taken into account in the design of a fast adder. One choice is the carry-skip adder, which because of its great topological regularity and layout simplicity is conside...
متن کاملAnalysis and design of CMOS Manchester adders with variable carry-skip
Carry-skip adders compare favorably with other adders for efficient VLSI implementation. Lehman has shown that carry-skip adders with variable-size blocks are faster than adders with constant size blocks. In 1967, Majerski suggested that multi-level implementation of the variable-size carry-skip adders would provide further improvement in speed. Almost two decades later, Oklobdzija and Barnes d...
متن کامل